import sys
import networkx as nx
import random
import VERTEX_CLASS as vc
import DC_CLASS as dc
import USER_CLASS as uc
import MYGRAPH_CLASS as mgc

random.seed()

print("Enter Number of Users: ", end = "")
Num_Users = int(input())

print("Enter Number of DCs: ", end = "")
Num_DCs = int(input())

'''
So this code inserts all of the necessary nodes,
as well as adds all of the necessary edges, with some
weights for now.
'''
OurGraph = mgc.MyGraph(Num_DCs, Num_Users)
OurGraph.Set_Latencies()
OurGraph.Set_DC_Owners()
OurGraph.Set_Edge_Costs()
OurGraph.Set_DC_Costs()
#print(OurGraph.nodes())

OurGraph.Find_Optimal_Path_Set()


   
                
                
